1 1 Ja n 20 01 Mutual Information of Population Codes and Distance Measures in Probability Space
نویسندگان
چکیده
We studied the mutual information between a stimulus and a large system consisting of stochastic, statistically independent elements that respond to a stimulus. The Mutual Information (MI) of the system saturates exponentially with system size. A theory of the rate of saturation of the MI is developed. We show that this rate is controlled by a distance function between the response probabilities induced by different stimuli. This function, which we term the Confusion Distance between two probabilities, is related to the Renyi α-Information.
منابع مشابه
Mutual information of population codes and distance measures in probability space.
We studied the mutual information between a stimulus and a system consisting of stochastic, statistically independent elements that respond to a stimulus. Using statistical mechanical methods the properties of the mutual information (MI) in the limit of a large system size N are calculated. For continuous valued stimuli, the MI increases logarithmically with N and is related to the log of the F...
متن کاملar X iv : m at h / 05 01 18 3 v 1 [ m at h . PR ] 1 2 Ja n 20 05 Partly Divisible Probability Distributions
Given a probability distribution µ a set Λ(µ) of positive real numbers is introduced, so that Λ(µ) measures the " divisibility " of µ. The basic properties of Λ(µ) are described and examples of probability distributions are given, which exhibit the existence of a continuum of situations interpolating the extreme cases of infinitely and minimally divisible probability distributions.
متن کاملar X iv : c s / 07 01 11 2 v 1 [ cs . I T ] 1 7 Ja n 20 07 ( l , s ) − Extension of Linear Codes
We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n, k. Among these new codes there is an optimal ternary [88, 8, 54]3 code. We develop an algorithm, which starts with already good codes C , i.e. codes with high minimum distance d for given length n and dimensio...
متن کاملar X iv : m at h / 07 01 45 1 v 1 [ m at h . D S ] 1 6 Ja n 20 07 YOUNG MEASURES , SUPERPOSITION AND TRANSPORT
We discuss a space of Young measures in connection with some variational problems. We use it to present a proof of the Theorem of Tonelli on the existence of minimizing curves. We generalize a recent result of Ambrosio, Gigli and Savaré on the decomposition of the weak solutions of the transport equation. We also prove, in the context of Mather theory, the equality between Closed measures and H...
متن کاملFeature Selection Using Multi Objective Genetic Algorithm with Support Vector Machine
Different approaches have been proposed for feature selection to obtain suitable features subset among all features. These methods search feature space for feature subsets which satisfies some criteria or optimizes several objective functions. The objective functions are divided into two main groups: filter and wrapper methods. In filter methods, features subsets are selected due to some measu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001